From Branching to Linear Time, Coalgebraically
نویسندگان
چکیده
منابع مشابه
From Branching to Linear Time, Coalgebraically
We consider state-based systems modelled as coalgebras whose type incorporates branching, and show that by suitably adapting the definition of coalgebraic bisimulation, one obtains a general and uniform account of the linear-time behaviour of a state in such a coalgebra. By moving away from a boolean universe of truth values, our approach can measure the extent to which a state in a system with...
متن کاملFreedom, Weakness, and Determinism: From Linear-Time to Branching-Time
Model checking is a method for the veri cation of systems with respect to their speci cations. Symbolic model-checking, which enables the veri cation of large systems, proceeds by calculating xed-point expressions over the system's set of states. The -calculus is a branching-time temporal logic with xed-point operators. As such, it is a convenient logic for symbolic modelchecking tools. In part...
متن کاملLinear Time Datalog and Branching Time Logic
We survey recent results about the relation between Datalog and temporal veriication logics. Datalog is a well-known database query language relying on the logic programming paradigm. We introduce Dat-alog LITE, a fragment of Datalog with well-founded negation, which has an easy stratiied semantics and a linear time model checking algorithm. Datalog LITE subsumes temporal languages such as CTL ...
متن کاملLinear Time Datalog for Branching Time Logic
In this paper we show that Datalog is well-suited as a temporal veriication language. Dat-alog is a well-known database query language relying on the logic programming paradigm. We introduce Datalog LITE, a fragment of Datalog with well-founded negation, and present a linear time model checking algorithm for Datalog LITE. We show that Datalog LITE subsumes temporal languages such as CTL and the...
متن کاملThe Quantitative Linear-Time--Branching-Time Spectrum
We present a distance-agnostic approach to quantitative verification. Taking as input an unspecified distance on system traces, or executions, we develop a game-based framework which allows us to define a spectrum of different interesting system distances corresponding to the given trace distance. Thus we extend the classic linear-time–branching-time spectrum to a quantitative setting, parametr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2017
ISSN: 0169-2968,1875-8681
DOI: 10.3233/fi-2017-1474